Monotonicity preservation on triangles

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity preservation on triangles

It is well known that Bernstein polynomials on triangles preserve monotonicity. In this paper we define and study three kinds of monotonicity preservation of systems of bivariate functions on a triangle. We characterize and compare several of these systems and derive some geometric applications.

متن کامل

Tensor-product monotonicity preservation

The preservation of surface shape is important in geometric modelling and approximation theory. In geometric modelling one would like to manipulate the shape of the surface being modelled by the simpler task of manipulating the control points. In scattered data approximation one might wish to approximate bivariate data sampled from a function with a shape property by a spline function sharing t...

متن کامل

Selective monotonicity preservation in scalar advection

An efficient method for scalar advection is developed that selectively preserves monotonicity. Monotonicity preservation is applied only where the scalar field is likely to contain discontinuities as indicated by significant grid-cell-to-grid-cell variations in a smoothness measure conceptually similar to that used in weighted essentially non-oscillatory (WENO) methods. In smooth regions, the n...

متن کامل

On the preservation of monotonicity by extended mappings

Images of fuzzy relations provide powerful access to fuzzifications of properties of and/or relationships between fuzzy sets. As an important example, images of fuzzy orderings canonically lead to a concept of ordering of fuzzy sets. This contribution studies in which way the partial (i.e. componentwise) monotonicity of an n-ary mapping transfers to its extension to fuzzy sets.

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Calculus of Minimals: Deriving Dynamic-Programming Algorithms based on Preservation of Monotonicity

Constructing efficient algorithms is difficult and often considered to be a privilege of a few specialists. Program calculation is a methodology for easy construction of efficient algorithms, where efficient algorithms are systematically derived from naive but obviously correct algorithms by calculational laws. This paper shows an ongoing effort to give a clear and effective methodology to deal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1999

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-99-01176-x